New approach to greedy vector quantization
نویسندگان
چکیده
We extend some rate of convergence results greedy quantization sequences already investigated in 2015. show, for a more general class distributions satisfying certain control, that the error these has an optimal and distortion mismatch property is satisfied. will give non-asymptotic Pierce type estimates. The recursive character vector allows improvements to algorithm computation implementation formula quantization-based numerical integration. Furthermore, we establish further properties sub-optimality sequences.
منابع مشابه
Greedy vector quantization
We investigate the greedy version of the L-optimal vector quantization problem for an Rvalued random vector X ∈ L. We show the existence of a sequence (aN )N≥1 such that aN minimizes a 7→ ∥min1≤i≤N−1 |X−ai| ∧ |X−a| ∥∥ Lp (L-mean quantization error at level N induced by (a1, . . . , aN−1, a)). We show that this sequence produces L -rate optimal N -tuples a = (a1, . . . , aN ) (i.e. the L -mean q...
متن کاملGreedy Aggregation for Vector Quantization
Abstract. Vector quantization is a classical problem that appears in many fields. Unfortunately, the quantization problem is generally non-convex, and therefore affords many local minima. The main problem is finding an initial approximation that is close to a “good” local minimum. Once such an approximation is found, the Lloyd–Max method may be used to reach a local minimum near it. In recent y...
متن کاملA New Approach of Vector Quantization Applied
This paper describes a new method based on Vector Quantization (VQ). Instead of quantizing blocks of the image by the vectors, the vectors are rst rescaled to be the closest to the block. We are looking for the most representative patterns of the image, two blocks having the same pattern if they are similar after translation and scaling in gray grey levels. A new way of VQ is also introduced us...
متن کاملA New Approach to Texture Coding using Stochastic Vector Quantization
A new method for texture coding which combines 2-D linear prediction and stochastic vector quantization is presented in this paper. To encode a texture, a linear predictor is computed first. Next, a codebook following the prediction error model is generated and the prediction error is encoded with VQ, using an algorithm which takes into account the pixels surrounding the block being encoded. In...
متن کاملA vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2022
ISSN: ['1573-9759', '1350-7265']
DOI: https://doi.org/10.3150/21-bej1350